<title>「一本通 4.1 例 3」校门外的树</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cmath&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstring&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#define N 100005</span>
<span class="pl-cp">#define lowbit(x) ((x)&amp;(-(x)))</span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-n">h</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">],</span><span class="pl-n">t</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">];</span>
<span class="pl-kt">void</span> <span class="pl-nf">add</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">[],</span><span class="pl-kt">int</span> <span class="pl-n">k</span><span class="pl-p">){</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">k</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">+=</span><span class="pl-n">lowbit</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">))</span> <span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">++</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">sum</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">[],</span><span class="pl-kt">int</span> <span class="pl-n">k</span><span class="pl-p">){</span>
    <span class="pl-kt">int</span> <span class="pl-n">ans</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">k</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&gt;</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">-=</span><span class="pl-n">lowbit</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">))</span> <span class="pl-n">ans</span><span class="pl-o">+=</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
    <span class="pl-k">return</span> <span class="pl-n">ans</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
        <span class="pl-kt">int</span> <span class="pl-n">k</span><span class="pl-p">,</span><span class="pl-n">x</span><span class="pl-p">,</span><span class="pl-n">y</span><span class="pl-p">;</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">k</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">x</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">y</span><span class="pl-p">);</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">k</span><span class="pl-o">==</span><span class="pl-mi">1</span><span class="pl-p">){</span>
            <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">h</span><span class="pl-p">,</span><span class="pl-n">x</span><span class="pl-p">);</span>
            <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">t</span><span class="pl-p">,</span><span class="pl-n">y</span><span class="pl-p">);</span>
        <span class="pl-p">}</span>
        <span class="pl-k">else</span><span class="pl-p">{</span>
            <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">sum</span><span class="pl-p">(</span><span class="pl-n">h</span><span class="pl-p">,</span><span class="pl-n">y</span><span class="pl-p">)</span><span class="pl-o">-</span><span class="pl-n">sum</span><span class="pl-p">(</span><span class="pl-n">t</span><span class="pl-p">,</span><span class="pl-n">x</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">));</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>